An Asynchronous Maximum Independent Set Algorithm By Myopic Luminous Robots On Grids

Abstract We consider the problem of constructing a maximum independent set with mobile myopic luminous robots on grid network whose size is finite but unknown to robots. In this setting, enter one by from corner grid, and they eventually have be disseminated nodes so that occupied positions form network. assume are asynchronous, anonymous, silent execute same distributed algorithm. paper, we propose two algorithms: The first assumes number light colors each robot three visible range two, uses additional assumption local edge-labeling exists for node. To remove assumption, second seven, three. both algorithms, movements $O(n(L+l))$ steps, where $n$ $L$ $l$ dimensions.